bool AddQ( Queue Q, ElementType X ){
	if(Q->Count==Q->MaxSize){
		printf("Queue Full\n");
		return false;
	}
	Q->Data[Q->Front+(Q->Front++)%MaxSize]=X;
	return true;
}
ElementType DeleteQ( Queue Q ){
	if(Q->Count==0){
		printf("Queue Empty\n");
		return ERROR;
	}
	ElementType d=Q->Data[Q->Front];
	Q->Count--;
	Q->Front++;
	(Q->Front)%=Q->MaxSize;
	return d; 
}
